An iterative and regenerative method for DNA sequencing.
نویسنده
چکیده
This paper presents, to our knowledge, the first iterative DNA sequencing method that regenerates the product of interest during each iterative cycle, allowing it to overcome the critical obstacles that impede alternative iterative approaches to DNA sequencing: loss of product and the accumulation of background signal due to incomplete reactions. It can sequence numerous double-stranded (ds) DNA segments in parallel without gel resolution of DNA fragments and can sequence DNA that is almost entirely double-stranded, preventing the secondary structures that impede sequencing by hybridization. This method uses ligation of an adaptor containing the recognition domain for a class-IIS restriction endonuclease and digestion with a class-IIS restriction endonuclease that recognizes the adaptor's recognition domain. This generates a set of DNA templates that are each composed of a short overhang positioned at a fixed interval with respect to one end of the original dsDNA fragment. Adaptor ligation also appends a unique sequence during each iterative cycle, so that the polymerase chain reaction can be used to regenerate the desired template-precursor before class-IIS restriction endonuclease digestion. Following class-IIS restriction endonuclease digestion, sequencing of a nucleotide in each overhang occurs by template-directed ligation during adaptor ligation or through a separate template-directed polymerization step with labeled ddNTPs. DNA sequencing occurs in strides determined by the number of nucleotides separating the recognition and cleavage domains for the class-IIS restriction endonuclease encoded in the ligated adaptor, maximizing the span of DNA sequenced for a given number of iterative cycles. This method allows the concurrent sequencing of numerous dsDNA segments in a microplate format, and in the future it can be adapted to biochip format.
منابع مشابه
An iterative method for amenable semigroup and infinite family of non expansive mappings in Hilbert spaces
begin{abstract} In this paper, we introduce an iterative method for amenable semigroup of non expansive mappings and infinite family of non expansive mappings in the frame work of Hilbert spaces. We prove the strong convergence of the proposed iterative algorithm to the unique solution of a variational inequality, which is the optimality condition for a minimization problem. The results present...
متن کاملDetection of R882 Mutations in DNMT3A Gene in Acute Myeloid Leukemia: A Method Comparison Study
Background: Somatic mutations in the hotspot region of the DNA-methyltransferase 3A (DNMT3A) gene were recurrently identified in acute myeloid leukemia (AML). It is believed that DNMT3A mutations confer an adverse prognosis for AML patients. These lines of evidence support the need for a rapid and cost-efficient method for the detection of these mutations. The present study aimed to establish h...
متن کاملIterative Deconvolution for Automatic Basecalling of the Dna Electrophoresis Time Series
In DNA (deoxyribonucleic acid) sequencing, there are four possible chemical base types: adenine (A), cytosine (C), guanine (G), thymine (T), which contain genetic information. The four base types are identified by examining four DNA electrophoresis time series. This procedure is called “basecalling”. However, in practice, there are many other undesired signal features that prevent the accurate ...
متن کاملPopulation genetic studies of Liza aurata using D-Loop sequencing in the southeast and southwest coasts of the Caspian Sea
Genetic diversity as an important marker of the ecological status of aquatic ecosystems is considered a unique and powerful tool to evaluate biological communities. In order to evaluate the genetic diversity among golden mullet species (Liza aurata) in the southeast and southwest coasts of the Caspian Sea by D-Loop gene sequencing, a total of 23 fin specimens of golden mullet were collected fro...
متن کاملFinding the polar decomposition of a matrix by an efficient iterative method
Theobjective in this paper to study and present a new iterative method possessing high convergence order for calculating the polar decompostion of a matrix. To do this, it is shown that the new scheme is convergent and has high convergence. The analytical results are upheld via numerical simulations and comparisons.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- BioTechniques
دوره 22 5 شماره
صفحات -
تاریخ انتشار 1997